Some Tilings of the Plane Whose Singular Points Form a Perfect Set
نویسندگان
چکیده
منابع مشابه
Some Polyomino Tilings of the Plane
We calculate the generating functions for the number of tilings of rectangles of various widths by the right tromino, the L tetromino, and the T tetromino. This allows us to place lower bounds on the entropy of tilings of the plane by each of these. For the T tetromino, we also derive a lower bound from the solution of the Ising model in two dimensions.
متن کاملSingular Points of Plane Curves
ly isomorphic to (C×)r−1 × (C), and hence also to (S1)r−1 × (R), where r = |J | is the number of branches and k = δ(C)− r+1 = 1 2 (μ(C) + 1 − r). The construction of the Jacobian variety J(C̃) of the non-singular curve C̃ in the large is standard in algebraic geometry. There is also a notion of Jacobian of a singular curve C , defined e.g. in [85], which, like the other, is an abelian group. Ther...
متن کاملContinuous Maps of the Interval Whose Periodic Points Form a Closed Set
We show that for a continuous map of a closed interval to itself, if the set of periodic points is closed, then every recurrent point is periodic. If, furthermore, the set of least periods of the periodic points is finite, then every nonwandering point is periodic. This answers a question of L. Block [Proc. Amer. Math. Soc. 67 (1977), 357-360]. Introduction. In [1] and [2], L. Block studied con...
متن کاملComputing singular points of plane rational curves
We compute the singular points of a plane rational curve, parametrically given, using the implicitization matrix derived from the μ-basis of the curve. It is shown that singularity factors, which are defined and uniquely determined by the elementary divisors of the implicitization matrix, contain all the information about the singular points, such as the parameter values of the singular points ...
متن کاملApproximating the bottleneck plane perfect matching of a point set
A bottleneck plane perfect matching of a set of n points in R is defined to be a perfect non-crossing matching that minimizes the length of the longest edge; the length of this longest edge is known as bottleneck. The problem of computing a bottleneck plane perfect matching has been proved to be NP-hard. We present an algorithm that computes a bottleneck plane matching of size at least n5 in O(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1983
ISSN: 0002-9939
DOI: 10.2307/2045500